DISTILL: Learning Domain-Specific Planners by Example

نویسندگان

  • Elly Winner
  • Manuela M. Veloso
چکیده

An interesting alternative to domain-independent planning is to provide example plans to demonstrate how to solve problems in a particular domain and to use that information to learn domainspecific planners. Others have used example plans for case-based planning, but the retrieval and adaptation mechanisms for the inevitably large case libraries raise efficiency issues of concern. In this paper, we introduce dsPlanners, or automatically generated domain-specific planners. We present the DISTILL algorithm for learning dsPlanners automatically from example plans. DISTILL converts a plan into a dsPlanner and then merges it with previously learned dsPlanners. Our results show that the dsPlanners automatically learned by DISTILL compactly represent its domain-specific planning experience. Furthermore, the dsPlanners situationally generalize the given example plans, thus allowing them to efficiently solve problems that have not previously been encountered. Finally, we present the DISTILL procedure to automatically acquire one-step loops from example plans, which permits experience acquired from small problems to be applied to solving arbitrarily large ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DISTILL: Towards Learning Domain-Specific Planners by Example

Domain-independent general-purpose planning has focused on reducing the search involved in an existing generalpurpose planning algorithm. An interesting alternative is to use example plans to demonstrate how to solve problems in a particular domain and to use that information to solve new problems independently of a domain-independent planner. Others have used example plans for case-based plann...

متن کامل

Automatically Acquiring Planning Templates from Example Plans

General-purpose planning can solve problems in a variety of domains but can be quite inefficient. Domain-specific planners are more efficient but are difficult to create. In this paper, we introduce template-based planning, a novel paradigm for automatically generating domain-specific programs, or templates. We present the DISTILL algorithm for learning templates automatically from example plan...

متن کامل

Learning Template Planners from Example Plans

Planners are powerful tools for problem solving because they provide a complete sequence of actions to achieve a goal from a particular initial state. Classical planning research has addressed this problem in a domain-specific manner—the same algorithm generates a complete plan for any domain specification. This generality comes at a cost; domain-independent planners have difficulty with larges...

متن کامل

Learning Looping Domain-Specific Planners from Example Plans

Planners are powerful tools for problem solving because they provide a complete sequence of actions to achieve a goal from a particular initial state. Classical planning research has addressed this problem in a domain-independent manner— the same algorithm generates a complete plan for any domain specification. This generality comes at a cost; domainindependent planners have difficulty with lar...

متن کامل

Learning Macro-Actions for Arbitrary Planners and Domains

Many complex domains and even larger problems in simple domains remain challenging in spite of the recent progress in planning. Besides developing and improving planning technologies, re-engineering a domain by utilising acquired knowledge opens up a potential avenue for further research. Moreover, macro-actions, when added to the domain as additional actions, provide a promising means by which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003